منابع مشابه
A Survey of NP-Complete Puzzles
Single-player games (often called puzzles) have received considerable attention from the scientific community. Consequently, interesting insights into some puzzles, and into the approaches for solving them, have emerged. However, many puzzles have been neglected, possibly because they are unknown to many people. In this article, we survey NP-Complete puzzles in the hope of motivating further re...
متن کاملSpiral Galaxies Puzzles are NP-complete
We will show that the question of whether or not a given Spiral Galaxies puzzle has a solution is NP-complete. To do so, we construct Spiral Galaxies puzzles which correspond to arbitrary Boolean circuits. A circuit will be satisfied, (that is, have a set of inputs which give the desired outputs) if and only if the corresponding puzzle has a solution. Since Satisfiability is the canonical NP-co...
متن کاملAddressing NP-Complete Puzzles with Monte-Carlo Methods
NP-complete problems are a challenging task for researchers, who investigate tractable versions and attempt to generalise the methods used for solving them. Over the years a large set of successful standard methods have been developed. We mention A* and IDA* which have proven to be reasonably successful in solving a set of NP-complete problems, particularly single-agent games (puzzles). However...
متن کاملSurvey of polynomial transformations between NP-complete problems
This paper aims at being a guide to understand polynomial transformations and polynomial reductions between NP-complete problems by presenting the methodologies for polynomial reductions/transformations and the differences between reductions and transformations. To this end the article shows examples of polynomial reductions/transformations and the restrictions to reduce/transform between NP-co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ICGA Journal
سال: 2008
ISSN: 1389-6911,2468-2438
DOI: 10.3233/icg-2008-31103